A question of standards Raising standards through choice

SIGLEAvailable from British Library Document Supply Centre-DSC:3535.962692(1/3) / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Characterizing width two for variants of treewidth

In this paper, we consider the notion of \emph{special treewidth}, recently introduced by Courcelle\cite{Courcelle2012}. In a special tree decomposition, for each vertex $v$ in a given graph, the bags containing $v$ form a rooted path. We show that the class of graphs of special treewidth at most two is closed under taking minors, and give the complete list of the six minor obstructions. As an intermediate result, we prove that every connected graph of special treewidth at most two can be constructed by arranging blocks of special treewidth at most two in a specific tree-like fashion. Inspired from the notion of special treewidth, we introduce three natural variants of treewidth, namely \emph{spaghetti treewidth}, \emph{strongly chordal treewidth} and \emph{directed spaghetti treewidth}. All these parameters lie between pathwidth and treewidth, and we provide common structural properties on these parameters. For each parameter, we prove that the class of graphs having the parameter at most two is minor closed, and we characterize those classes in terms of a \emph{tree of cycles} with additional conditions. Finally, we show that for each $k\geq 3$, the class of graphs with special treewidth, spaghetti treewidth, directed spaghetti treewidth, or strongly chordal treewidth, respectively at most $k$, is not closed under taking minors

Characterizing width two for variants of treewidth

In this paper, we consider the notion of special treewidth, recently introduced by Courcelle (2012). In a special tree decomposition, for each vertex v in a given graph, the bags containing v form a rooted path. We show that the class of graphs of special treewidth at most two is closed under taking minors, and give the complete list of the six minor obstructions. As an intermediate result, we prove that every connected graph of special treewidth at most two can be constructed by arranging blocks of special treewidth at most two in a specific tree-like fashion. Inspired by the notion of special treewidth, we introduce three natural variants of treewidth, namely spaghetti treewidth, strongly chordal treewidth and directed spaghetti treewidth. All these parameters lie between pathwidth and treewidth, and we provide common structural properties on these parameters. For each parameter, we prove that the class of graphs having the parameter at most two is minor closed, and we characterize those classes in terms of a tree of cycles with additional conditions. Finally, we show that for each k≥3, the class of graphs with special treewidth, spaghetti treewidth, directed spaghetti treewidth, or strongly chordal treewidth, respectively at most k, is not closed under taking minors